翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

axiom of power set : ウィキペディア英語版
axiom of power set

In mathematics, the axiom of power set is one of the Zermelo–Fraenkel axioms of axiomatic set theory.
In the formal language of the Zermelo–Fraenkel axioms, the axiom reads:
:\forall A \, \exists P \, \forall B \, (\in P \iff \forall C \, (C \in B \Rightarrow C \in A) )
where ''P'' stands for the Power set of ''A'', \mathcal(A). In English, this says:
:Given any set ''A'', there is a set \mathcal(A) such that, given any set ''B'', ''B'' is a member of \mathcal(A) if and only if every element of ''B'' is also an element of ''A''.
More succinctly: ''for every set A, there is a set \mathcal(A) consisting precisely of the subsets of A.''
Note the subset relation \subseteq is not used in the formal definition as subset is not a primitive relation in formal set theory; rather, subset is defined in terms of set membership, \in. By the axiom of extensionality, the set \mathcal(A) is unique.
The axiom of power set appears in most axiomatizations of set theory. It is generally considered uncontroversial, although constructive set theory prefers a weaker version to resolve concerns about predicativity.
== Consequences ==

The Power Set Axiom allows a simple definition of the Cartesian product of two sets X and Y:
: X \times Y = \.
Notice that
:x, y \in X \cup Y
:\, \ \in \mathcal(X \cup Y)
:(x, y) = \ \} \in \mathcal(\mathcal(X \cup Y))
and thus the Cartesian product is a set since
: X \times Y \subseteq \mathcal(\mathcal(X \cup Y)).
One may define the Cartesian product of any finite collection of sets recursively:
: X_1 \times \cdots \times X_n = (X_1 \times \cdots \times X_) \times X_n.
Note that the existence of the Cartesian product can be proved without using the power set axiom, as in the case of the Kripke–Platek set theory.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「axiom of power set」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.